Equational logic for names and binders
نویسنده
چکیده
منابع مشابه
Hard Life with Weak Binders
We introduce weak binders, a lightweight construct to deal withfresh names in nominal calculi. Weak binders do not define the scopeof names as precisely as the standard ν-binders, yet they enjoy strongsemantic properties. We provide them with a denotational seman-tics, an equational theory, and a trace inclusion preorder. Further-more, we present a trace-preserving mappi...
متن کاملNominal Equational Logic
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is an extension of ordinary equational logic with assertions about the freshness of names. It is shown to be both sound and complete for the support interpretation of freshness and equality provided by the Gabbay-Pitts nominal...
متن کاملNominal Lawvere Theories: A category theoretic account of equational theories with names
Names, or object-level variables, are a ubiquitous feature in programming languages and other computational applications. Reasoning with names, and related constructs like binding and freshness, often poses conceptual and technical challenges. Nominal Equational Logic (NEL) is a logic for reasoning about equations in the presence of freshness side conditions. This paper gives a category theoret...
متن کاملContextual equivalence for inductive definitions with binders in higher order typed functional programming
Correct handling of names and binders is an important issue in meta-programming. This paper presents an embedding of constraint logic programming into the αML functional programming language, which provides a provably correct means of implementing proof search computations over inductive definitions involving names and binders modulo α-equivalence. We show that the execution of proof search in ...
متن کاملNominal Lawvere Theories
Lawvere theories provide a category theoretic view of equational logic, identifying equational theories with small categories equipped with finite products. This formulation allows equational theories to be investigated as first class mathematical entities. However, many formal systems, particularly in computer science, are described by equations modulated by side conditions asserting the “fres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010